翻訳と辞書 Words near each other ・ Digov ・ Digovdərə ・ Digoxigenin ・ Digoxin ・ Digoxin immune fab ・ Digoxin poisoning ・ Digram ・ Digrammia ・ Digrammia continuata ・ Digrammia gnophosaria ・ Digrammia irrorata ・ Digrammia ocellinata ・ Digrammia subminiata ・ Digraph ・ Digraph (orthography) ・ Digraph realization problem ・ Digraphia ・ Digraphs and trigraphs ・ Digras ・ Digras (Vidhan Sabha constituency) ・ Digrauta ・ Digression ・ DigRF ・ Digri ・ Digri railway station ・ Digroup ・ Digru ・ Digré ・ Digs ・ DigSin Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Digraph realization problem ： ウィキペディア英語版 Digraph realization problem The digraph realization problem is a decision problem in graph theory. Given pairs of nonnegative integers $((a\_1,b\_1),\backslash ldots,(a\_n,b\_n))$, the problem asks whether there is a labeled simple directed graph such that each vertex $v\_i$ has indegree $a\_i$ and outdegree $b\_i$. ==Solutions== The problem belongs to the complexity class P. Two algorithms are known to prove that. The first approach is given by the Kleitman–Wang algorithms constructing a special solution with the use of a recursive algorithm. The second one is a characterization by the Fulkerson–Chen–Anstee theorem, i.e. one has to validate the correctness of $n$ inequalities. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Digraph realization problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.